Scaling Laws of Capacity for Large Scale Wireless Networks

نویسندگان

  • Cheng Wang
  • Xiang-Yang Li
  • Changjun Jiang
  • Yunhao Liu
  • ShaoJie Tang
چکیده

In this paper, we focus on the networking-theoretic multicast capacity bounds for both random extended networks (REN) and random dense networks (RDN) under Gaussian Channel model, when all wireless nodes have the same constant transmission power P . During the transmission, the power decays along path with attenuation exponent α > 2. In REN and RDN, n nodes are randomly distributed in the square region with sidelength √ n and 1, respectively. We randomly choose ns nodes as the sources of multicast sessions, and for each source v, we pick uniformly at random nd nodes as the destination nodes of v. Based on percolation theory, we propose multicast schemes and analyze the achievable throughput taking account of all ns and nd. As the specific case of our results, we show that for ns = Θ(n), the per-session multicast capacity of RDN is Θ( 1 √ndn ) when nd = O( n (log n)3 ) and is Θ( 1 n ) when nd = Ω( n log n ); the per-session multicast capacity of REN is Θ( 1 √ ndn ) when nd = O( n (log n)α+1 ) and is Θ( 1 nd · (log n) 2 ) when nd = Ω( n log n ).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On The Data Gathering Capacity of Large Scale Multihop Wireless Networks

In typical sensor network and mesh network scenarios, a subset of nodes (‘sources’) must send data to some designated set of destinations (“gateways”), while other nodes serve as relays. This some-to-some communication paradigm is distinct from the well-studied many-to-many, many-to-one, broadcast, and multicast paradigms, and is perhaps more prevalent than the other paradigms. We study the sca...

متن کامل

Capacity scaling in large wireless networks

We consider networks consisting of nodes with radios, and without any wired infrastructure, thus necessitating all communication to take place only over shared wireless medium. We focus mainly on the flat fading channel model. We study capacity scaling laws in such systems when the number of nodes gets large. We show that in extended networks (network with constant density of users) capacity sc...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

Capacity-Delay Scaling in Arbitrary Wireless Networks

Gupta and Kumar (2000) studied capacity scaling in random wireless networks with n nodes under the protocol interference model. They showed that the per source-destination pair capacity scales as Θ(1/ √ n logn) when n distinct random source-destination pairs communicate simultaneously. For the same setup, El Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay scales as Θ( √ n/ logn)....

متن کامل

[Article] Capacity Scaling of Wireless Networks with Inhomogeneous Node Density: Lower Bounds

We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area and analyze the scaling laws of their transport capacity as the number of nodes increases. In particular, we consider nodes placed according to a shot-noise Cox process (SNCP), which allows to model the clustering behavior usually recognized in large-scale systems. F...

متن کامل

Scaling Laws for Throughput Capacity and Delay in Wireless Networks - A Survey

The capacity scaling law of wireless networks has been considered as one of the most fundamental issues. In this survey, we aim at providing a comprehensive overview of the development in the area of scaling laws for throughput capacity and delay in wireless networks. We begin with background information on the notion of throughput capacity of random networks. Based on the benchmark random netw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008